منابع مشابه
Interaction Graphs: Multiplicatives
We introduce a graph-theoretical representation of proofs of multiplicative linear logic which yields both a denotational semantics and a notion of truth. For this, we use a locative approach (in the sense of ludics [Gir01]) related to game semantics [HO00, AJM94] and the Danos-Regnier interpretation of GoI operators as paths in proof nets [ADLR94, DR95]. We show how we can retrieve from this l...
متن کاملPerfect matchings and series-parallel graphs: multiplicatives proof nets as R&B-graphs
Perfect matchings and series-parallel graphs: multiplicatives proof nets as R&B-graphs Extended Abstract] Abstract A graph-theoretical look at multiplicative proof nets lead us to two new descriptions of a proof net, both as a graph endowed with a perfect matching. The rst one is a rather conventional encoding of the connectives which nevertheless allows us to unify various sequentialisation te...
متن کاملSemantically Inactive Multiplicatives and Words as Types
The literature on categorial type logic includes proposals for semantically inactive additives, quantifiers, and modalities Morrill (1994[17]), Hepple (1990[2]), Moortgat (1997[9]), but to our knowledge there has been no proposal for semantically inactive multiplicatives. In this paper we formulate such a proposal (thus filling a gap in the typology of categorial connectives) in the context of ...
متن کاملExpressing Additives Using Multiplicatives and Subexponentials
Subexponential logic is a variant of linear logic with a family of exponential connectives—called subexponentials—that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening and contraction. We show that a classical propositional multiplicative subexponential logic (MSEL) with one unrestricted and two linear subexponentials can en...
متن کاملJump from Parallel to Sequential Proofs: Multiplicatives
We introduce a new class of multiplicative proof nets, J-proof nets, which are a typed version of Faggian and Maurel’s multiplicative L-nets. In J-proof nets, we can characterize nets with different degrees of sequentiality, by gradual insertion of sequentiality constraints. As a byproduct, we obtain a simple proof of the sequentialisation theorem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2012
ISSN: 0168-0072
DOI: 10.1016/j.apal.2012.04.005